Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
491	PDF Document Add to Reading List Source URL: www.gbrmpa.gov.au Language: English - Date: 2011-07-17 20:41:01 Complexity classes NP
492	[removed]– 0 4 BOOK PUBLISHERS EMBA R G O : Add to Reading List Source URL: www.ausstats.abs.gov.au Language: English - Date: 2008-09-11 07:18:15 NP E-book Media technology Complexity classes Publishing Royalties
493	PDF Document Add to Reading List Source URL: www.ga.gov.au Language: English - Date: 2013-10-14 20:00:27 18th South African Parliament Washington State Judicial elections Complexity classes Politics of the Philippines NP
494	Dynamic Symmetry Breaking by Simulating Zykov Contraction Bas Schaafsma, Marijn Heule! and Hans van Maaren Department of Software Technology, Delft University of Technology [removed], [removed], h.van Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-04-21 07:17:46 Graph coloring NP-complete problems Complexity classes Boolean satisfiability problem SL 2-satisfiability Greedy coloring Theoretical computer science Graph theory Mathematics
495	Microsoft Word - V_3_PEEES_The impact of the introduction of nuclear power on electricity prices in a power exchange-based liberalized market.docx Add to Reading List Source URL: www.parisschoolofeconomics.eu Language: English - Date: 2014-04-01 11:55:06 Energy Complexity classes Electricity market Base load power plant NP Electric power transmission Electrical grid Power station Electric power Electric power distribution Electromagnetism
496	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory
497	CS 330 – Spring 2013, Final Study Questions Exam will be closed book As with the midterm, I will definitely ask some questions which test your knowledge of basic algorithms we’ve learned in the second half of the cla Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-05-01 16:01:14 NP-complete Algorithm NP P-complete Complexity classes Mathematics Computer science
498	Journal of Artificial Intelligence Research[removed]432 Submitted 07/08; published[removed]The Computational Complexity of Dominance and Consistency in CP-Nets Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-11-25 12:36:17 Automated planning and scheduling STRIPS FO Constructible universe Net IP Polynomial hierarchy PSPACE Function Mathematics Applied mathematics Complexity classes
499	CS 330 – Spring 2013, Assignment 6 Problems due in the drop-box by 5PM, Thursday, April 18th (Monday schedule that day) Late assignments will only be accepted up until 5PM on Friday, April 19th Question[removed]pts). Cha Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-04-05 16:53:19 Applied mathematics NP-complete NP P P versus NP problem NP-hard Theoretical computer science Computational complexity theory Complexity classes
500	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan Add to Reading List Source URL: www.cs.uic.edu Language: English - Date: 2013-12-21 14:10:02 Logic in computer science Boolean algebra Complexity classes NP-complete problems Conjunctive normal form Computational problems 2-satisfiability Boolean satisfiability problem Disjunctive normal form Theoretical computer science Computational complexity theory Applied mathematics

UPDATE